package com.jack.leetcode.test;

public class 避免重复字母的最小删除成本 {

    public int minCost(String s, int[] cost) {
        return 0;
    }
}
